Defeating classical bit commitments with a quantum computer
نویسندگان
چکیده
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to perform a measurement. Similar situations had been encountered previously in the design of Quantum Oblivious Transfer. The question is whether a classical bit commitment could be used for this specific purpose. We demonstrate that, surprisingly, classical unconditionally concealing bit commitments do not help.
منابع مشابه
Quantum Bit Commitment from a Computation Bound
Alice is a private citizen whose computational resources are modest. Bob represents a large organisation at the forefront of computational and cryptological research. Bob’s computational and cryptanalytic power is unknown to Alice, but Bob can confidently estimate a bound on Alice’s ability to carry out a computation that would break a classical bit commitment of his. Alice wishes to commit a b...
متن کاملHow to Convert a Flavor of Quantum Bit Commitment
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence, statistically concealing but computationall...
متن کاملConverting the flavor of a quantum bit commitment
The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence of the reduction, statist...
متن کاملSecure Classical Bit Commitment over Finite Channels
If mistrustful parties A and B control two or more appropriately located sites, special relativity can be used to guarantee that a pair of messages exchanged by A and B are independent. Using this fact, an unconditionally secure relativistic bit commitment protocol, RBC1, was recently defined. Security is maintained in RBC1 by exchanging a sequence of messages whose transmission rate increases ...
متن کاملNovel Design of n-bit Controllable Inverter by Quantum-dot Cellular Automata
Application of quantum-dot is a promising technology for implementing digital systems at nano-scale. Quantum-dot Cellular Automata (QCA) is a system with low power consumption and a potentially high density and regularity. Also, QCA supports the new devices with nanotechnology architecture. This technique works </...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998